Loop-separable programs and their first-order definability
نویسندگان
چکیده
An answer set program with variables is first-order definable on finite structures if the set of its finite answer sets can be captured by a first-order sentence. Characterizing classes of programs that are first-order definable on finite structures is theoretically challenging and of practical relevance to Answer Set Programming. In this paper, we identify a non-trivial class of answer set programs called loop-separable programs and show that they are first-order definable on finite structures.
منابع مشابه
On the Progression Semantics and Boundedness of Answer Set Programs
In this paper, we propose a progression semantics for firstorder answer set programs. Based on this new semantics, we are able to define the notion of boundedness for answer set programming. We prove that boundedness coincides with the notions of recursion-free and loop-free under program equivalence, and is also equivalent to first-order definability of answer set programs on arbitrary structu...
متن کاملA progression semantics for first-order logic programs
In this paper, we propose a progression semantics for first-order normal logic programs, and show that it is equivalent to the well-known stable model (answer set) semantics. The progressional definition sheds new insights into Answer Set Programming (ASP), for instance, its relationships to Datalog, First-Order Logic (FOL) and Satisfiability Modulo Theories (SMT). As an example, we extend the ...
متن کاملComplexity of First Order ID-Logic
First Order ID-Logic interprets general first order, nonmonotone, inductive definability by generalizing the wellfounded semantics for logic programs. We show that, for general (thus perhaps infinite) structures, inference in First Order ID-Logic is completeΠ2 over the natural numbers. We also prove a Skolem Theorem for the logic: every consistent formula of First Order ID-Logic has a countable...
متن کاملA Game-theoretic Characterization on the First-order Indefinability of Answer Set Programs
Under the general theory of stable models [17, 24], a first-order answer set program is semantically equivalent to a second-order sentence. Then a first-order answer set program is called first-order definable on finite structures if the set of finite answer sets of the program can be captured by a first-order sentence. First-order definability is a desirable property which provides alternative...
متن کاملUniqueness, Definability and Interpolation
This paper is meant to be a comment on Beth's definability theorem. In it we shall make the following points. Implicit definability as mentioned in Beth's theorem for first-order logic is a special case of a more general notion of uniqueness. If a is a nonlogical constant, Tat a set of sentences, cx* an additional constant of the same syntactical category as a and T7t* a copy of Tat with cx* in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 175 شماره
صفحات -
تاریخ انتشار 2011